EGALITARIAN SOLUTION FOR GAMES WITH DISCRETE SIDE PAYMENT

نویسندگان

چکیده

In this paper, we study the egalitarian solution for games with discrete side payment, where characteristic function is integer-valued and payoffs of players are integral vectors. The solution, introduced by Dutta Ray in 1989, a concept transferable utility cooperative form, which combines commitment egalitarianism promotion indivisual interests consistent manner. We first point out that nice properties (in continuous case) do not extend to payment. Then show Lorenz stable set, may be regarded as variant has such Davis–Maschler reduced game property converse property. For proofs utilize recent results convex analysis on decreasing minimization an M-convex set investigated Frank Murota.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The egalitarian solution for convex games: some characterizations

The egalitarian solution for TU-games as introduced by Dutta and Ray [Dutta, B., Ray, D., 1989. A concept of egalitarianism under participation constraints, Econometrica 57, 615–635] is studied. Five characterizations of the restriction of this solution to the class of convex games are given. They all involve a stability property due to the concept of the equal division core from Selten [Selten...

متن کامل

Axiomatizing the Harsanyi solution, the symmetric egalitarian solution and the consistent solution for NTU-games

The validity of the axiomatization of the Harsanyi solution for NTU-games by Hart (1985) is shown to depend on the regularity conditions imposed on games. Following this observation, we propose two related axiomatic characterizations, one of the symmetric egalitarian solution (Kalai and Samet, 1985) and one of the consistent solution (Maschler and Owen, 1992). The three axiomatic results are st...

متن کامل

A Simple Axiomatization of the egalitarian solution

In this paper, we present a simple axiomatization of the n-person egalitarian solution. The single axiom sufficient for characterization is a new condition which we call symmetric decomposition.

متن کامل

The complexity of egalitarian mechanisms for linear programming games

We show that the most cost-efficient subset problem for linear programming games is NP-hard, and in fact inapproximable within a constant factor in polynomial time, unless P = NP. This in turn implies that computing the prices output by an egalitarian mechanism and computing a cost allocation in the equal split-off set for linear programming games is NP-hard.

متن کامل

The rights egalitarian solution for NTU sharing problems

The purpose of this paper is to extend the Rights Egalitarian solution (Herrero, Maschler & Villar, 1999) to the context of nontransferable utility sharing problems. Such an extension is not unique. Depending on the kind of properties we want to preserve we obtain two di¤erent generalizations. One is the "proportional solution", that corresponds to the Kalai-Smorodinsky solution for surplus sha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of The Operations Research Society of Japan

سال: 2021

ISSN: ['0453-4514', '1878-6871', '2188-8299']

DOI: https://doi.org/10.15807/jorsj.64.87